Computational complexity theory - PDFSEARCH.IO - Document Search Engine

Computational complexity theory
Results: 2049

#	Item
511	IEEE TRANSACTIONS ON ROBOTICS, VOL. 23, NO. 5, OCTOBERApproximate Algorithms for a Collaboratively Controlled Robotic Camera Add to Reading List Source URL: www.ieor.berkeley.edu Language: English - Date: 2007-10-15 15:12:36 Operations research Computational complexity theory Convex optimization Linear programming Approximation algorithm Algorithm Lattice Mathematics Theoretical computer science Applied mathematics
512	On the Impossibility of Tight Cryptographic Reductions Christoph Bader, Tibor Jager, Yong Li, and Sven Sch¨age Horst G¨ortz Institute for IT Security, Ruhr-University Bochum, Germany {christoph.bader, tibor.jager, yong Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2015-04-27 06:52:51 Public-key cryptography Digital signature Key management Notary Ciphertext indistinguishability Computational complexity theory Reduction Security parameter RSA Cryptography Theoretical computer science Applied mathematics
513	A Theory and Algorithms for Combinatorial Reoptimization? Hadas Shachnai1?? , Gal Tamir1 , and Tami Tamir2 1 2 Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2012-02-29 12:43:33 Operations research Complexity classes NP-complete problems Approximation algorithm Optimization problem Reduction NP Knapsack problem Dynamic programming Theoretical computer science Applied mathematics Computational complexity theory
514	INFORMS INTERFACES Vol. 00, No. 0, Xxxxx 0000, pp. 000–000 issn \| eissn 1526-551X \| 00 \| 0000 \| 0001 Add to Reading List Source URL: tbenoist.pagesperso-orange.fr Language: English - Date: 2011-11-21 02:25:22 Operations research Mathematical optimization Convex optimization Internet marketing Advertising Linear programming Television advertisement Pay per click Knapsack problem Theoretical computer science Applied mathematics Computational complexity theory
515	Join seminar The Hong Kong University of Science and Technology Approximation Algorithms for Perishable Inventory Systems Dr. Xiting Gong Add to Reading List Source URL: www.bm.ust.hk Language: English - Date: 2014-03-13 04:17:53 Supply chain management Marketing Computational complexity theory Approximation algorithm Inventory Systems engineering Business Technology Operations research
516	CCCG 2003, Halifax, Nova Scotia, August 11–13, 2003 Minimizing the endpoint trace length of rod motions amidst polygonal obstacles is NP-hard Extended Abstract Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2004-01-08 18:44:37 Applied mathematics Optical devices Network theory NP Shortest path problem Beam splitter Theoretical computer science Computational complexity theory Complexity classes
517	URL: http://www.elsevier.nl/locate/entcs/volume61.html 19 pages Parameterized Complexity: The Main Ideas and Connections to Practical Computing Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-08-06 03:10:30 NP-complete problems Analysis of algorithms Complexity classes Parameterized complexity Dominating set Kernelization Vertex cover Clique problem NP-complete Theoretical computer science Computational complexity theory Applied mathematics
518	Approximation Schemes for Deal Splitting and Covering Integer Programs with Multiplicity Constraints∗ Ariel Kulik† Hadas Shachnai‡ Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2011-10-04 12:29:59 Approximation algorithms Complexity classes Polynomial-time approximation scheme Optimization problem APX Parameterized complexity Bin packing problem PTAS reduction Theoretical computer science Applied mathematics Computational complexity theory
519	Adaptive Informative Path Planning in Metric Spaces Zhan Wei Lim, David Hsu, and Wee Sun Lee National University of Singapore, Singapore, Singapore Abstract. In contrast to classic robot motion planning, informati Add to Reading List Source URL: www.comp.nus.edu.sg Language: English - Date: 2014-07-16 20:39:51 Operations research Approximation algorithm Computational complexity theory Travelling salesman problem Algorithm XTR Theoretical computer science Mathematics Applied mathematics
520	Small, Stupid, and Scalable: Secure Computing with Faerieplay∗ Alexander Iliev Sean W. Smith Add to Reading List Source URL: www.cs.dartmouth.edu Language: English - Date: 2010-11-08 12:53:14 Secure multi-party computation Circuit complexity Circuit Lookup table Boolean circuit Advantage Randomized algorithm Blinding Field-programmable gate array Theoretical computer science Applied mathematics Computational complexity theory

UPDATE